Motivated by applications in online labor markets, we study the problem of forming multiple teams of experts in a social network to accomplish multiple tasks that require different combinations of skills. Our goal is to maximize the total profit of tasks that are completed by these teams subject to the capacity constraints of the experts. We study both the offline and online settings of the problem. For the offline problem, we present a simple and practical algorithm that improves upon previous results in many situations. For the online problem, we design competitive deterministic and randomized online algorithms. These are complemented by some hardness results in both settings.
Journal of Combinatorial Optimization - Nowadays, the rapid development of intelligent navigation systems has profound impacts on the routing of traffic users. With the assistance of these... 相似文献
Journal of Combinatorial Optimization - This paper studies the price of fairness in a two-agent single machine scheduling game. In this game, two agents compete to perform their jobs on a common... 相似文献
Journal of Combinatorial Optimization - The determination of bounds on the size of codes with given minimum distance is an important problem in the coding theory. In this paper, we construct codes... 相似文献
Journal of Combinatorial Optimization - Given a vertex-weighted connected graph $$G = (V, E, w(\cdot ))$$ , the maximally balanced connected graph k-partition (k-BGP) seeks to partition the vertex... 相似文献
Let G be a connected graph with n≥2 vertices. Suppose that a fire breaks out at a vertex v of G. A firefighter starts to protect vertices. At each time interval, the firefighter protects one vertex not yet on fire. At the end of each time interval, the fire spreads to all the unprotected vertices that have a neighbor on fire. Let sn(v) denote the maximum number of vertices in G that the firefighter can save when a fire breaks out at vertex v. The surviving rate ρ(G) of G is defined to be ∑v∈V(G)sn(v)/n2, which is the average proportion of saved vertices. In this paper, we show that if G is a planar graph with n≥2 vertices and having girth at least 7, then $\rho(G)>\frac{1}{301}$. 相似文献
Knowledge management has been identified as a key enabler to achieve organisation’s value chain competitiveness. It, however, has been facing fresh challenges in a global supply chain setting. This paper proposes a global knowledge chain management (GKCM) framework that identifies and prioritises critical knowledge that a global supply chain can focus on to support integrated decisions. The framework explores three types of global context knowledge, namely global market knowledge, global capacity knowledge and global supply network configuration knowledge. Empirical study has been undertaken within the manufacturing industry to evaluate the GKCM framework. Analytic network process has been explored as a key method to assess the importance of the global knowledge constructs from supply chain managers’ perspectives. A key contribution of the paper is that it advances existing knowledge chain management approaches within one organisation and its local supply chain to include the global context knowledge applicable to global manufacturing settings, and highlights how the GKCM framework can support global supply chain integrated decisions. 相似文献